Distributed arrays: an algebra for generic distributed query processing

نویسندگان

چکیده

Abstract We propose a simple model for distributed query processing based on the concept of array . Such an has fields some data type whose values can be stored different machines. It offers operations to manipulate all in parallel within algebra The arrays considered are one-dimensional and just serve partitioned set. Distributed rest given set types called basic implemented by piece software engine provides complete environment single machine. assume this is extensible operations. Operations one master which controls engines workers maps respective their executed workers. completely generic: any or operation added will immediately available processing. To demonstrate use as language processing, we describe fairly complex algorithm density-based similarity clustering. novel contribution itself. Its implementation shown terms algebra. As Secondo system used, rich providing useful tools such main memory M-trees, graphs, DBScan implementation.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Query Processing Using Suffix Arrays

Suffix arrays are more efficient than inverted files for solving complex queries in a number of applications related to text databases. Examples arise when dealing with biological or musical data or with texts written in oriental languages, and when searching for phrases, approximate patterns and, in general, regular expressions involving separators. In this paper we propose algorithms for proc...

متن کامل

An intelligent query processing for distributed ontologies

0164-1212/$ see front matter 2009 Elsevier Inc. A doi:10.1016/j.jss.2009.06.008 * Corresponding author. Tel.: +82 42 350 3537; fax E-mail addresses: [email protected] (J. L (J.-H. Park), [email protected] (M.-J. Park) (C.-W. Chung), [email protected] (J.-K. Min). In this paper, we propose an intelligent distributed query processing method considering the characteristics of a distrib...

متن کامل

Adaptive Distributed Query Processing

For a large-scale distributed query engine, which supports long running queries over federated data sources, it is hard to obtain statistics of data sources, servers and other resources. In addition, the characteristics of data sources and servers are changing at runtime. A traditional distributed query optimizer or centralized adaptive techniques is inadequate in this situation. In this paper,...

متن کامل

An adaptable distributed query processing architecture

Traditionally, distributed query optimization techniques generate static query plans at compile time. However, the optimality of these plans depends on many parameters (such as the selectivities of operations, the transmission speeds and workloads of servers) that are not only difficult to estimate but are also often unpredictable and fluctuant at runtime. As the query processor cannot dynamica...

متن کامل

An Adaptive Distributed Query Processing Grid Service

Grid services provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. We are developing a data grid service prototype that aims at providing transparent use of grid resources to data intensive scientific applications. Our prototype was designed having as target three main issues: (1) dynamic scheduling and allocation...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Distributed and Parallel Databases

سال: 2021

ISSN: ['0926-8782', '1573-7578']

DOI: https://doi.org/10.1007/s10619-021-07325-2